The (non-)existence of perfect codes in Fibonacci cubes
نویسندگان
چکیده
The Fibonacci cube Γn is obtained from the n-cube Qn by removing all the vertices that contain two consecutive 1s. It is proved that Γn admits a perfect code if and only if n ≤ 3.
منابع مشابه
The (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملDetermining which Fibonacci (p, r)-cubes can be Z-transformation graphs
The Fibonacci (p, r)-cube is an interconnection topology, which includes a wide range of connection topologies as its special cases, such as the Fibonacci cube, the postal network, etc. Klavžar and Žigert [S. Klavžar, P. Žigert, Fibonacci cubes are the resonance graphs of fibonaccenes, Fibonacci Quart. 43 (2005) 269–276] proved that Fibonacci cubes are just the Z-transformation graphs (also cal...
متن کاملFibonacci Cubes Are the Resonance Graphs of Fibonaccenes
Fibonacci cubes were introduced in 1993 and intensively studied afterwards. This paper adds the following theorem to these studies: Fibonacci cubes are precisely the resonance graphs of fibonaccenes. Here fibonaccenes are graphs that appear in chemical graph theory and resonance graphs reflect the structure of their perfect matchings. Some consequences of the main result are also listed.
متن کاملخواص متریک و ترکیبیاتی مکعبهای فیبوناتچی و لوکاس
An n-dimensional hypercube, Q_n, is a graph in which vertices are binary strings of length n where two vertices are adjacent if they differ in exactly one coordinate. Hypercubes and their subgraphs have a lot of applications in different fields of science, specially in computer science. This is the reason why they have been investigated by many authors during the years. Some of their subgraphs ...
متن کاملAsymptotic properties of Fibonacci cubes and Lucas cubes
It is proved that the asymptotic average eccentricity and the asymptotic average degree of both Fibonacci cubes and Lucas cubes are (5 + √ 5)/10 and (5 − √ 5)/5, respectively. A new labeling of the leaves of Fibonacci trees is introduced and it is proved that the eccentricity of a vertex of a given Fibonacci cube is equal to the depth of the associated leaf in the corresponding Fibonacci tree. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 116 شماره
صفحات -
تاریخ انتشار 2016